package interviewClassic150;

public class MaxProfit {
    public int maxProfit(int[] prices) {
        int n = prices.length;
        if (n == 1) return 0;
        int[][] dp = new int[n][2];//dp[i][0]代表第i天持有股票所拥有的现金，dp[i][1]代表第i天不持有股票
        dp[0][0] = -prices[0];
        dp[0][1] = 0;

        for (int i = 1; i < n; i++) {
            dp[i][0] = Math.max(dp[i - 1][0],dp[i - 1][1] - prices[i]);
            dp[i][1] = Math.max(dp[i - 1][1],dp[i - 1][0] + prices[i]);
        }

        return dp[n - 1][1];
    }
}
